Non-finitely axiomatisable two-dimensional modal logics
نویسندگان
چکیده
We show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many propositional variables, and formulas of arbitrarily large modal nesting-depth.
منابع مشابه
On Modal Products with the Logic of 'Elsewhere'
The finitely axiomatisable and decidable modal logic Diff of ‘elsewhere’ (or ‘difference operator’) is known to be quite similar to S5. Their validity problems have the same coNP complexity, and their Kripke frames have similar structures: equivalence relations for S5, and ‘almost’ equivalence relations, with the possibility of some irreflexive points, for Diff . However, their behaviour may di...
متن کاملFinite Frames for K4.3 x S5 Are Decidable
If a modal logic L is finitely axiomatisable, then it is of course decidable whether a finite frame is a frame for L: one just has to check the finitely many axioms in it. If L is not finitely axiomatisable, then this might not be the case. For example, it is shown in [7] that the finite frame problem is undecidable for every L between the product logics K ×K ×K and S5 × S5 × S5. Here we show t...
متن کاملThe modal logic of affine planes is not finitely axiomatisable
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke frame with two sorts (points and lines) and three modal accessibility relations, namely the point-line and line-point incidence relations and the parallelism relation between lines. We show that the modal logic of af...
متن کاملBimodal logics with a 'weakly connected' component without the finite model property
There are two known general results on the finite model property (fmp) of commutators [L0, L1] (bimodal logics with commuting and confluent modalities). If L is finitely axiomatisable by modal formulas having universal Horn first-order correspondents, then both [L,K] and [L,S5] are determined by classes of frames that admit filtration, and so have the fmp. On the negative side, if both L0 and L...
متن کاملA Combination of Explicit and Deductive Knowledge with Branching Time: Completeness and Decidability Results
Logics for knowledge and time comprise logic combinations between epistemic logic S5n for n agents and temporal logic. In this paper we examine a logic combination of Computational Tree Logic and an epistemic logic augmented to include an additional epistemic operator representing explicit knowledge. We show the resulting system enjoys the finite model property, decidability and is finitely axi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 77 شماره
صفحات -
تاریخ انتشار 2012